a(f, a(f, x)) → a(x, x)
a(h, x) → a(f, a(g, a(f, x)))
↳ QTRS
↳ DependencyPairsProof
a(f, a(f, x)) → a(x, x)
a(h, x) → a(f, a(g, a(f, x)))
A(h, x) → A(f, x)
A(f, a(f, x)) → A(x, x)
A(h, x) → A(f, a(g, a(f, x)))
A(h, x) → A(g, a(f, x))
a(f, a(f, x)) → a(x, x)
a(h, x) → a(f, a(g, a(f, x)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
A(h, x) → A(f, x)
A(f, a(f, x)) → A(x, x)
A(h, x) → A(f, a(g, a(f, x)))
A(h, x) → A(g, a(f, x))
a(f, a(f, x)) → a(x, x)
a(h, x) → a(f, a(g, a(f, x)))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
A(h, x) → A(f, x)
A(f, a(f, x)) → A(x, x)
a(f, a(f, x)) → a(x, x)
a(h, x) → a(f, a(g, a(f, x)))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
A(f, a(f, x)) → A(x, x)
Used ordering: Polynomial interpretation [25,35]:
A(h, x) → A(f, x)
The value of delta used in the strict ordering is 1.
POL(f) = 0
POL(a(x1, x2)) = 1/4 + (4)x_2
POL(A(x1, x2)) = (4)x_2
POL(h) = 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ DependencyGraphProof
A(h, x) → A(f, x)
a(f, a(f, x)) → a(x, x)
a(h, x) → a(f, a(g, a(f, x)))